skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Vadapalli, Adithya"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, 35th International Conference on Machine Learning (ICML'18))
    We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of $$n$$ input $$d$$-dimensional vectors under Hamming, $$\ell_1, \ell_2$$ and $$\ell_\infty$$ distances. All our algorithms run in $$O(\log n)$$ rounds of MPC for any fixed $$d$$ and achieve $$(1+\epsilon)$$-approximation for all distances (except Hamming for which we show an exact algorithm). We also show constant-factor inapproximability results for $$o(\log n)$$-round algorithms under standard MPC hardness assumptions (for sufficiently large dimension depending on the distance used). Efficiency of implementation of our algorithms in Apache Spark is demonstrated through experiments on the largest available vector datasets from the UCI machine learning repository exhibiting speedups of several orders of magnitude. 
    more » « less
    Accepted Manuscript Full Text Available